منابع مشابه
On Harmonious Colouring of Trees
Let G be a simple graph and (G) denote the maximum degree of G. A harmonious colouring of G is a proper vertex colouring such that each pair of colours appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colours in such a colouring. In this paper it is shown that if T is a tree of order n and (T ) n2 , then there exists a harmonious colouring of T w...
متن کاملNotes on the genus Pileolaria (Pucciniales)
The results showed that Pileolaria terebinthi, type species of the genus Pileolaria is not a hemi–form or brachy–form rust species as mentioned among literature by several authors. Study on miscellaneous specimens collected from Iran and locus classicus of the species, France, revealed that P. terebinthi is an automacrocyclic rust and its aecial state is not uredinioi...
متن کاملFeature The harmonious robot
Purpose – To describe the design methodology and human-centre functionality of the whole arm manipulator (WAM) developed originally at MIT and brought to commercial fruition by Barrett Technology. Design/methodology/approach – The WAM arm is driven by cable-and-cylinder transmissions, which uniquely exhibits zero backlash with low friction and low inertia, endowing the WAM with good open-loop “...
متن کاملHarmonious Hashing
Hashing-based fast nearest neighbor search technique has attracted great attention in both research and industry areas recently. Many existing hashing approaches encode data with projection-based hash functions and represent each projected dimension by 1-bit. However, the dimensions with high variance hold large energy or information of data but treated equivalently as dimensions with low varia...
متن کاملHarmonious Coloring on Subclasses of Colinear Graphs
Given a simple graph G, a harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number is the least integer k for which G admits a harmonious coloring with k colors. Extending previous NP-completeness results of the harmonious coloring problem on subclasses of chordal and co-chordal graphs, we prove that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Emu - Austral Ornithology
سال: 1923
ISSN: 0158-4197,1448-5540
DOI: 10.1071/mu923059